A proof for a conjecture on the regularity of binomial edge ideals
نویسندگان
چکیده
In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph G, define invariant ?(G) as maximum size set G. We show that regularity binomial ideal G is bounded above by ?(G). This, particular, settles conjecture on ideals full generality.
منابع مشابه
Regularity Bounds for Binomial Edge Ideals
We show that the Castelnuovo–Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.
متن کاملThe Regularity of Binomial Edge Ideals of Graphs
We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for chordal graphs. We also prove the conjecture due to the authors for a class of chordal graphs. We determine the regularity of the binomial edge ideal of the join of graphs in terms of the reg...
متن کاملRegularity of second power of edge ideals
Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.
متن کاملBinomial edge ideals and rational normal scrolls
Let $X=left( begin{array}{llll} x_1 & ldots & x_{n-1}& x_n\ x_2& ldots & x_n & x_{n+1} end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...
متن کاملAn upper bound for the regularity of powers of edge ideals
A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$, denoted by match$(G)$. In this paper, we provide a generalization of this result for powers of edge ideals. More precisely, we show that for every graph $G$ and every $sgeq 1$, $${rm reg}( R/ I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2021.105432